#include <bits/stdc++.h>
using namespace std;
int a[100005],n,tot,cnt,ans;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++){
        if(a[i]==a[i-1]||i==1) cnt++;
        else{
            ans+=min(cnt,tot);
            tot-=min(cnt,tot);
            tot+=cnt;
            cnt=1;
        }
    }
    ans+=min(cnt,tot);
    cout<<n-ans;
    return 0;
}
